for _ in range(int(input())):
a = int(input())
b = list(map(int, input().split()))
c = sum(b)
ans = c ** (1/2)
if str(ans) == str(int(ans))+'.0':
print('YES')
else:
print("NO")#include <bits/stdc++.h>
using namespace std;
#define lli long long int
void solve(){
lli n;
cin>>n;
lli a[n];
for(lli i = 0; i < n; i++){
cin>>a[i];
}
lli sum = 0;
for(lli i = 0; i < n; i++){
sum += a[i];
}
lli count = 0;
lli num = 1;
do{
if (num*num == sum){
count++;
}
num++;
} while(num*num <= sum);
if(count == 0){
cout<<"NO"<<endl;
} else{
cout<<"YES"<<endl;
}
}
int main(){
lli t;
cin>>t;
while(t--){
solve();
}
}229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |